Note on vertex and total proper connection numbers
نویسندگان
چکیده
منابع مشابه
Total proper connection of graphs
A graph is said to be total-colored if all the edges and the vertices of the graph is colored. A path in a total-colored graph is a total proper path if (i) any two adjacent edges on the path differ in color, (ii) any two internal adjacent vertices on the path differ in color, and (iii) any internal vertex of the path differs in color from its incident edges on the path. A total-colored graph i...
متن کاملA note on the total detection numbers of cycles
Let G be a connected graph of size at least 2 and c :E(G)→{0, 1, . . . , k− 1} an edge coloring (or labeling) of G using k labels, where adjacent edges may be assigned the same label. For each vertex v of G, the color code of v with respect to c is the k-vector code(v) = (a0, a1, . . . , ak−1), where ai is the number of edges incident with v that are labeled i for 0 ≤ i ≤ k − 1. The labeling c ...
متن کاملOn the Vertex Folkman Numbers
For a graph G the symbol G v −→ (a1, . . . , ar) means that in every r-coloring of the vertices of G, for some i ∈ {1, 2, . . . , r}, there exists a monochromatic ai-clique of color i. The vertex Folkman numbers Fv(a1, . . . , ar; q) = min{|V (G)| : G v −→ (a1, . . . , ar) and Kq * G} are considered. We prove that Fv(2, . . . , 2 | {z } r ; r − 1) = r + 7, r ≥ 6 and Fv(2, . . . , 2 | {z } r ; r...
متن کاملA note on the vertex-distinguishing proper coloring of graphs with large minimum degree
We prove that the number of colors required to color properly the edges of a graph of order n and δ(G) > n/3 in such a way that any two vertices are incident with different sets of colors is at most ∆(G) + 5.
متن کاملNote on Vertex-Disjoint Cycles
Häggkvist and Scott asked whether one can find a quadratic function q(k) such that if G is a graph of minimum degree at least q(k), then G contains vertex-disjoint cycles of k consecutive even lengths. In this paper, it is shown that if G is a graph of average degree at least k + 19k + 12 and sufficiently many vertices, then G contains vertex-disjoint cycles of k consecutive even lengths, answe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics
سال: 2016
ISSN: 0972-8600,2543-3474
DOI: 10.1016/j.akcej.2016.06.003